Learnability of Some Eecient Representations of Boolean Functions
نویسنده
چکیده
This thesis studies the learnability of several representation classes of Boolean functions: a restriction on k-term DNF, ordered binary decision diagrams and monotone term decision lists. We also show that some operations on these representation classes can be done in polynomial time. This fact is one of the motivations of the study (and use) of those classes.
منابع مشابه
ON THE FUZZY SET THEORY AND AGGREGATION FUNCTIONS: HISTORY AND SOME RECENT ADVANCES
Several fuzzy connectives, including those proposed by Lotfi Zadeh, can be seen as linear extensions of the Boolean connectives from the scale ${0,1}$ into the scale $[0,1]$. We discuss these extensions, in particular, we focus on the dualities arising from the Boolean dualities. These dualities allow to transfer the results from some particular class of extended Boolean functions, e.g., from c...
متن کاملThe Pac-Learnability of Recursive Logic Programs
We analyze the learnability of function-free recursive logic programs in the models of polynomial predictability and identiication from equivalence queries. Our ultimate goal is delineating the boundaries of eecient learnability for recursive logic programs. In the rst portion of the paper, we describe a restricted class of recursive programs that is learnable from equivalence queries alone. Th...
متن کاملBoolean Manipulation with Free BDD's - First Experimental Results
It is shown that Free Binary Decision Diagrams (FBDD's), with respect to a predeened type, provide a canonical representation and allow eecient solutions of the basic tasks in Boolean manipulation similarly as the well{known OBDD's do. But in contrast to OBDD's, typed FBDD's allow more succinct representations of Boolean functions. For experimentation we have used an FBDD{ package. The types we...
متن کامل